Domain reduction techniques for global NLP and MINLP optimization
نویسندگان
چکیده
منابع مشابه
A Differential Evolution Approach for Global Optimization of Minlp Problems
The global optimization of mixed integer non-linear programming (MINLP) problems is an active research area in many engineering fields. In this work, Differential Evolution (DE), a hybrid Evolutionary Computation method, is used for the optimization of nonconvex MINLP problems and a comparison is made among the algorithms based on hybrid of Simplex & Simulated Annealing (MSIMPSA), Genetic Algor...
متن کاملInexact solution of NLP subproblems in MINLP
In the context of convex mixed integer nonlinear programming (MINLP), we investigate how the outer approximation method and the generalized Benders decomposition method are affected when the respective nonlinear programming (NLP) subproblems are solved inexactly. We show that the cuts in the corresponding master problems can be changed to incorporate the inexact residuals, still rendering equiv...
متن کاملGlobal Optimization of MINLP Problems in Process Synthesis and Design
Abstract : Two new methodologies for the global optimization of MINLP models, the Special structure Mixed Integer Nonlinear BB, SMIN– BB, and the General structure Mixed Integer Nonlinear BB, GMIN– BB, are presented. Their theoretical foundations provide guarantees that the global optimum solution of MINLPs involving twice–differentiable nonconvex functions in the continuous variables can be id...
متن کاملA particle swarm optimization for solving NLP/MINLP process synthesis problems
A hybrid particle swarm optimization algorithm which includes two alternative gradient-based methods for handling constraints has been proposed to solve process synthesis and design problems which involve continuous and binary variables and equality and inequality constraints (a mixed integer non-linear programming problem, MINLP). The first method for handling constraints uses the Newton-Raphs...
متن کاملSome Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme combining several methods, such as linear programming, interval analysis, and cutting methods. Our goal is to integrate constraint programming techniques in this framework. Firstly, global constraints can be introduced ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2017
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-016-9267-5